Finite fields

Results: 995



#Item
211PERMUTATIONS, HYPERPLANES AND POLYNOMIALS OVER FINITE FIELDS ´ GACS, ´ ´ HEGER, ´

PERMUTATIONS, HYPERPLANES AND POLYNOMIALS OVER FINITE FIELDS ´ GACS, ´ ´ HEGER, ´

Add to Reading List

Source URL: www.cs.elte.hu

Language: English - Date: 2009-05-02 08:43:58
    212Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography by Sel¸cuk Baktır A Thesis Submitted to the Faculty

    Efficient Algorithms for Finite Fields, with Applications in Elliptic Curve Cryptography by Sel¸cuk Baktır A Thesis Submitted to the Faculty

    Add to Reading List

    Source URL: www.wpi.edu

    Language: English - Date: 2003-05-01 13:28:01
      213On Curves over Finite Fields with Jacobians of Small Exponent Kevin Ford Department of Mathematics, 1409 West Green Street University of Illinois at Urbana-Champaign Urbana, IL 61801, USA

      On Curves over Finite Fields with Jacobians of Small Exponent Kevin Ford Department of Mathematics, 1409 West Green Street University of Illinois at Urbana-Champaign Urbana, IL 61801, USA

      Add to Reading List

      Source URL: www.math.uiuc.edu

      Language: English - Date: 2008-09-21 09:45:03
        214Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

        Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

        Add to Reading List

        Source URL: weakdh.org

        Language: English - Date: 2015-10-15 14:53:20
        215A Removal Lemma for Systems of Linear Equations over Finite Fields Daniel Kr´al’∗ Oriol Serra†

        A Removal Lemma for Systems of Linear Equations over Finite Fields Daniel Kr´al’∗ Oriol Serra†

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:37
          216Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology  The 12th Workshop on Elliptic Curve Cryptography

          Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology The 12th Workshop on Elliptic Curve Cryptography

          Add to Reading List

          Source URL: www.hyperelliptic.org

          Language: English - Date: 2008-09-27 14:59:29
          217Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici=

          Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici=

          Add to Reading List

          Source URL: www.math.ru.nl

          Language: English - Date: 2008-03-28 07:26:11
          218E-th roots and static Diffie-Hellman using index calculus Antoine Joux1 Joint work with Reynald Lercier2 , David Naccache3 , Emmanuel Thome´ 4  Elliptic Curve Cryptography 2008

          E-th roots and static Diffie-Hellman using index calculus Antoine Joux1 Joint work with Reynald Lercier2 , David Naccache3 , Emmanuel Thome´ 4 Elliptic Curve Cryptography 2008

          Add to Reading List

          Source URL: www.hyperelliptic.org

          Language: English - Date: 2008-10-04 13:47:14
          219Constructing abelian varieties for cryptographic use Peter Stevenhagen ECC, Utrecht September 22, 2008

          Constructing abelian varieties for cryptographic use Peter Stevenhagen ECC, Utrecht September 22, 2008

          Add to Reading List

          Source URL: www.hyperelliptic.org

          Language: English - Date: 2008-10-05 20:16:07
          220IMAPP MATHEMATICS RADBOUD UNIVERSITY NIJMEGEN The Netherlands Better paths for elliptic curve primality proofs

          IMAPP MATHEMATICS RADBOUD UNIVERSITY NIJMEGEN The Netherlands Better paths for elliptic curve primality proofs

          Add to Reading List

          Source URL: www.math.ru.nl

          Language: English - Date: 2009-09-11 06:25:39